Identification of Vulnerable Lines in Smart Grid Systems Based on Affinity Propagation Clustering

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Identification of vulnerable node clusters against false data injection attack in an AMI based Smart Grid

In today's Smart Grid, the power Distribution System Operator (DSO) uses real-time measurement data from the Advanced Metering Infrastructure (AMI) for efficient, accurate and advanced monitoring and control. Smart Grids are vulnerable to sophisticated data integrity attacks like the False Data Injection (FDI) attack on the AMI sensors that produce misleading operational decision of the power s...

متن کامل

Affinity Propagation Clustering Using Path Based Similarity

Clustering is a fundamental task in data mining. Affinity propagation clustering (APC) is an effective and efficient clustering technique that has been applied in various domains. APC iteratively propagates information between affinity samples, updates the responsibility matrix and availability matrix, and employs these matrices to choose cluster centers (or exemplars) of respective clusters. H...

متن کامل

Adaptive Affinity Propagation Clustering

Affinity propagation clustering (AP) has two limitations: it is hard to know what value of parameter ‘preference’ can yield an optimal clustering solution, and oscillations cannot be eliminated automatically if occur. The adaptive AP method is proposed to overcome these limitations, including adaptive scanning of preferences to search space of the number of clusters for finding the optimal clus...

متن کامل

Battery Grouping with Time Series Clustering Based on Affinity Propagation

Battery grouping is a technology widely used to improve the performance of battery packs. In this paper, we propose a time series clustering based battery grouping method. The proposed method utilizes the whole battery charge/discharge sequence for battery grouping. The time sequences are first denoised with a wavelet denoising technique. The similarity matrix is then computed with the dynamic ...

متن کامل

Distributed and Incremental Clustering Based on Weighted Affinity Propagation

A new clustering algorithm Affinity Propagation (AP) is hindered by its quadratic complexity. The Weighted Affinity Propagation (WAP) proposed in this paper is used to eliminate this limitation, support two scalable algorithms. Distributed AP clustering handles large datasets by merging the exemplars learned from subsets. Incremental AP extends AP to online clustering of data streams. The paper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Internet of Things Journal

سال: 2019

ISSN: 2327-4662,2372-2541

DOI: 10.1109/jiot.2019.2897434